GPU Implementation of the 2D Delaunay Triangulation
نویسنده
چکیده
Delaunay triangulations have been well-studied and numerous implementations have been proposed and instantiated over the years, but it was not until recently (2008) that a method for computing the Delaunay triangulation has been performed on the GPU. Even still, it was still presented as a hybrid method, utilizing the CPU in conjunction with the GPU. The dual of the Delaunay triangulation, the Voronoi diagram has been implemented on the GPU on several different occasions [Hoff 1999], [Denny 2003], [Rong 2006], and [Rong 2007], but all of these methods have done so using a discretized version of the Voronoi. Unfortunately, it is not a trivial process to reproduce a true Delaunay triangulation from this discrete version of the Voronoi. One issue that [Rong 2008] pointed out is best described by looking at this image taken from their paper:
منابع مشابه
A parallel GPU-based algorithm for Delaunay edge-flips
The edge-flip technique can be used for transforming any existing triangular mesh into one that satisfies the Delaunay condition. Although several implementations for generating Delaunay triangulations are known, to the best of our knowledge no full parallel GPU-based implementation just dedicated to transform any existent triangulation into a Delaunay triangulation has been reported yet. In th...
متن کاملComputing 2D Constrained Delaunay Triangulation Using Graphics Hardware
This paper presents a novel approach, termed GPU-CDT, to compute the constrained Delaunay triangulation (CDT) for a planar straight line graph (PSLG), consisting of points and edges, using the graphics processing unit (GPU). Although there are many algorithms for constructing the 2D CDT using the CPU, there has been no known prior approach using the parallel computing power of the GPU efficient...
متن کاملA Quasi-Parallel GPU-Based Algorithm for Delaunay Edge-Flips∗
The Delaunay edge-flip algorithm is a practical method for transforming any existing triangular mesh S into a mesh T (S) that satisfies the Delaunay condition. Although several implementations of this algorithm are known, to the best of our knowledge no parallel GPU-based implementation has been reported yet. In the present work, we propose a quadriphasic and iterative GPU-based algorithm that ...
متن کاملTriangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
A b s t r a c t . Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement algorithm for quality mesh generation. Several implementation issues are discussed, including the choice of triangulation algorithms and data structures, the effect of several variants of the Delaunay refinement algorithm on mesh quality, and the use of a...
متن کاملCAD Tools for Creating Space-filing 3D Escher Tiles
We discuss the design and implementation of CAD tools for creating decorative solids that tile 3-space in a regular, isohedral manner. Starting with the simplest case of extruded 2D tilings, we describe geometric algorithms used for maintaining boundary representations of 3D tiles, including a Java implementation of an interactive constrained Delaunay triangulation library and a mesh-cutting al...
متن کامل